class Solution {
public:
    int ladderLength(string beginWord, string endWord, vector<string>& wordList) {
        size_t size = wordList[0].size(), i = 0;
        
        //endWord不在字典中
        for(; i < size; i++) {
            if(wordList[i] == endWord) break;
        }
        if(i == size)  return 0;

        vector<string> bv, ev;  
        //转化为一个可能性结果的表
        for(size_t i = 0; i < size; i++) {
            string bw = beginWord, ew = endWord;    
            bw[i] = '0', ew[i] = '0';
            push_back(bv);
            push_back(ev);
        }
        for(size_t i = 0; i < size; i++) {
            string tmp = wordList[i];
            for(size_t j = 0; j < size; j++){
                string tmp
            }
        }
    }
};